Tree-structured LFSR synthesis scheme for pseudo-exhaustive testing of VLSI circuits - Computers and Digital Techniques, IEE Proceedings-
نویسندگان
چکیده
A new test architecture, called TLS (tree-LFSWSR), generates pseudo-exhaustive test patterns for both combinational and sequential VLSI circuit is presented. Instead of using a single scan chain, the proposed test architecture routes a scan tree driven by the LFSR to generate all possible input pattems for each output cone. The new test architecture is able to take advantages of both signal sharing and signal reuse. The benefits are: the difficulty of test architecture synthesis can be eased by accelerating the searching process of appropriate residues; and the number of XOR gates to satisfy the pseudo-exhaustive test criterion can be reduced. The TLS test scheme mainly contains three phases: backbone generation, tree growing, and XOR-tree generation. Experimental results obtained by simulating combinational and sequential benchmark circuits are very encouraging.
منابع مشابه
Design of algorithm-based fault-tolerant VLSI array processor - Computers and Digital Techniques [see also IEE Proceedings-Computers and Digital Techniques], IEE
In the paper a systematic design methodology which maps a matrix arithmetic algorithm to a fault-tolerant array processor with different topologies and dimensions is presented. The design issues to be addressed in the method are: (a) how to derive a VLSI array with different topologies and dimensions from the algorithm; (b) how to distribute the data processing to the PES so that a faulty PE wi...
متن کاملAutomated synthesis of digital multiplexer networks - Computers and Digital Techniques [see also IEE Proceedings-Computers and Digital Techniques], IEE
A programmed algorithm is presented for the synthesis and optimisation of networks implemented with multiplexer universal logic modules. The algorithm attempts level by level optimisation selecting the control variables that result in minimum number of continuing branches. Cascaded networks, if realisable, are always found and given preference over tree networks, though mixtures of cascade and ...
متن کاملStructured multisignature algorithms - Computers and Digital Techniques, IEE Proceedings-
A structured multisignature scheme is an order-sensitive multisignature scheme that allows participating signers to sign messages in compliance with a specified signing order. It has been shown that the Burmester et al. order-sensitive multisignature scheme cannot prevent all signers producing a valid multisignature without following the specified signing order. The paper proposes two structure...
متن کاملEfficient state reduction methods for PLA-based sequential circuits - Computers and Digital Techniques [see also IEE Proceedings-Computers and Digital Techniques], IEE
/ Abstract: Experiences with heuristics for the state reduction of finite-state machines are presented and two new heuristic algorithms described in detail. Results on machines from the literature and from the MCNC benchmark set are shown. The area of the PLA implemention of the combinational component and the design time are used as figures of merit. The comparison of such parameters, when the...
متن کاملEfficient state reduction methods for PLA-based sequential circuits - Computers and Digital Techniques [see also IEE Proceedings-Computers and Digital Techniques], IEE
/ Abstract: Experiences with heuristics for the state reduction of finite-state machines are presented and two new heuristic algorithms described in detail. Results on machines from the literature and from the MCNC benchmark set are shown. The area of the PLA implemention of the combinational component and the design time are used as figures of merit. The comparison of such parameters, when the...
متن کامل